Learning Optimal Classification Trees Using a Binary Linear Program Formulation
نویسندگان
چکیده
منابع مشابه
Optimal Binary Search Trees
An optimal binary search tree is a binary search tree for which the nodes are arranged on levels such that the tree cost is minimum. For the purpose of a better presentation of optimal binary search trees, we will consider “extended binary search trees”, which have the keys stored at their internal nodes. Suppose “n” keys k1, k2, ... , k n are stored at the internal nodes of a binary search tre...
متن کاملOn Optimal Binary Search Trees
We present a new linear time heuristic for constructing binary search trees. The analysis of the algorithm, by establishing an upper bound on the cost of the produced binary search trees, permits to derive a limitation on the cost of optimal binary search trees. The obtained upper bound improve on previous results.
متن کاملLearning with few examples for binary and multiclass classification using regularization of randomized trees
The human visual system is often able to learn to recognize difficult object categories from only a single view, whereas automatic object recognition with few training examples is still a challenging task. This is mainly due to the human ability to transfer knowledge from related classes. Therefore, an extension to Randomized Decision Trees is introduced for learning with very few examples by e...
متن کاملExtended Linear Formulation for Binary Quadratic Problems
We propose and test a new linearisation technique for the Binary Quadratic Problems (BQPs). We computationally prove that the new formulation, called Extended Linear Formulation, can be effective for different classes of problems in practice. Our tests are based on two sets of classical BQPs from the literature, i.e., the Unconstrained BQP and the Maximum Cut of edge-weighted graphs. Finally we...
متن کاملLearning Classification Trees
Algorithms for learning cIassification trees have had successes in artificial intelligence and statistics over many years. This paper outlines how a tree learning algorithm can be derived using Bayesian statistics. This iutroduces Bayesian techniques for splitting, smoothing, and tree averaging. The splitting rule is similar to QuinIan’s information gain, while smoothing and averaging replace p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33011624